#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, m;
    cin >> n >> m;

    V<int> a(n + 1, 0), b(m + 1, 0);

    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, m) cin >> b[i];

    sort(ALL(b));

    a[1] = min(a[1], b[1] - a[1]);

    int mx = a[1];

    FOR(i, 2, n) {
        int t = lower_bound(b.begin() + 1, b.end(), mx + a[i]) - b.begin();
        if (a[i] >= mx) {
            if (t > m) {
                mx = max(mx, a[i]);
                continue;
            }
            if (a[i] >= b[t] - a[i]) {
                a[i] = b[t] - a[i];
            }
        } else {
            if (t > m) {
                NO;
                RE;
            }
            a[i] = b[t] - a[i];
        }
        mx = max(mx, a[i]);
    }

    YES;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
